Proving Open Properties by Induction

نویسنده

Jean-Claude Raoult

چکیده

Well-founded orders are the opposite of noetherian orders: every nonempty subset contains at least one minimal element. And a set is well-ordered when it is totally ordered by a wellfounded order: every nonempty set contains exactly one minimal element. Sofar, noetherian induction has been the most powerful way of proving properties inductively; it is indeed the most general one in the precise sence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Induction on Failing Derivations

A proof technique, called induction on failing derivations, is introduced. We wish to prove properties of judgments in deductive systems. Standard techniques exist for proving such properties on valid judgments; this note defines a technique for proving such properties on invalid (underivable) judgments.

متن کامل

A New Structural Induction Scheme for Proving Properties of Mutually Recursive Concepts

Structural induction schemes have been used for mechanically proving properties of self-recursive concepts in previous research. However, based on those schemeq, it becomes very difficult to automatically generate the right induction hypotheses whenever the conjectures are involved with mutually recursive concepts. This paper will show that the difficulties come mainly from the weak induction s...

متن کامل

"A la Burstall" Intermittent Assertions Induction Principles for Proving Inevitable Ability Properties of Programs

123 " A la Burstall " intermittent assertions induction principles for proving inevitability properties of programs Cousot, P. and R. Cousot, " A la Burstall " intermittent assertions induction principles for proving inevitability properties of programs, Theoretical Computer Science 120 (1993) 123-15.5. We formalize Burstall's (1974) intermittent assertions method (initially conceived for provi...

متن کامل

Inductive Theorem Proving for Design Speciications

We present a number of new results on inductive theorem proving for design speciications based on Horn logic with equality. Induction is explicit here because induction orderings are supposed to be part of the speciication. We show how the automatic support for program veriication is enhanced if the speciication satisses a bunch of rewrite properties, summarized under the notion of canonicity. ...

متن کامل